This is TeX, WAITS Version 2.1 (preloaded format=plain 87.2.17)  14 JUN 1987 21:18
**XPAPER.TEX
(XPAPER.TEX[TEX,DEK] [1] [2] [3] [4]
[]\tenrm When your in-struc-tor made up this prob-lem, he 
@ via @@0 b=0 p=0 d=100
@@1: line 1.2 t=100 -> @@0
said `\tentt \tracingparagraphs=1\tenrm ' so that his tran-script 
@ via @@1 b=4 p=0 d=196
@@2: line 2.2 t=296 -> @@1
file would ex-plain why T[]X has bro-ken the para-
@\discretionary via @@2 b=175 p=50 d=46725
@@3: line 3.0- t=47021 -> @@2
graph 
@ via @@2 b=25 p=0 d=1225
@@4: line 3.3 t=1521 -> @@2
into lines in a par-tic-u-lar way. He also said 
@ via @@3 b=69 p=0 d=6241
@@5: line 4.1 t=53262 -> @@3
`\tentt \pretolerance=-1\tenrm ' so that hy-phen-ation would be 
@ via @@5 b=43 p=0 d=2809
@@6: line 5.1 t=56071 -> @@5
tried im-me-di-ately. The out-put is shown on the next 
@ via @@6 b=0 p=0 d=100
@@7: line 6.2 t=56171 -> @@6
page; use it to de-ter-mine what line breaks would 
@ via @@7 b=153 p=0 d=36569
@@8: line 7.0 t=92740 -> @@7
have 
@ via @@7 b=34 p=0 d=1936
@@9: line 7.3 t=58107 -> @@7
been found by a sim-pler al-go-rithm that breaks 
@ via @@8 b=1 p=0 d=10121
@@10: line 8.2 t=102861 -> @@8
one 
@ via @@9 b=15 p=0 d=10625
@@11: line 8.1 t=68732 -> @@9
line at a time. (The sim-pler al-go-rithm finds 
@ via @@10 b=164 p=0 d=40276
@@12: line 9.0 t=143137 -> @@10
the 
@ via @@10 b=0 p=0 d=100
@ via @@11 b=192 p=0 d=40804
@@13: line 9.0 t=109536 -> @@11
@@14: line 9.2 t=102961 -> @@10
break-point that yields fewest de-mer-its on the 
@ via @@12 b=174 p=0 d=33856
@@15: line 10.0 t=176993 -> @@12
first 
@ via @@12 b=41 p=0 d=12601
@ via @@13 b=75 p=0 d=7225
@ via @@14 b=75 p=0 d=7225
@@16: line 10.1 t=110186 -> @@14
line, then chooses it and starts over again.) 
@\par via @@15 b=0 p=-10000 d=10100
@\par via @@16 b=0 p=-10000 d=100
@@17: line 11.2- t=110286 -> @@16

 [5] [6]
\bak=\box16
\bakk=\box17
\ind=\count25
 [7] [8] [9] [10] [11] [12] [13]
[14] [15] [16] [17] [18] [19] [20]
Output written on XPAPER.DVI[TEX,DEK] (20 pages, 99372 bytes).